G<sup>2</sup>-Continuity Extension Algorithm of Ball B-Spline Curves
نویسندگان
چکیده
منابع مشابه
An Extension of Chaiken's Algorithm to B-Spline Curves with Knots in Geometric Progression
Chaiken's algorithm is a procedure for inserting new knots into uniform quadratic Bspline curves by doubling the control points and taking two successive averages. Lane and Riesenfeld showed that Chaiken's algorithm extends to uniform B-spline curves of arbitrary degree. By generalizing the notion of successive averaging, we further extend Chaiken's algorithm to B-spline curves of arbitrary deg...
متن کاملNUAT B-spline curves
This paper presents a new kind of splines, called non-uniform algebraic-trigonometric B-splines (NUAT B-splines), generated over the space spanned by {1, t, . . . , tk−3, cos t, sin t} in which k is an arbitrary integer larger than or equal to 3. We show that the NUAT B-splines share most properties of the usual polynomial B-splines. The subdivision formulae of this new kind of curves are given...
متن کاملB-Spline Curves
However, we cannot easily control the curve locally. That is, any change to an individual control point will cause changes in the curve along its full length. In addition, we cannot create a local cusp in the curve, that is, we cannot create a sharp corner unless we create it at the beginning or end of a curve where it joins another curve. Finally, it is not possible to keep the degree of the B...
متن کاملStitching B - Spline Curves Symbolically Stitching B - spline
Stitching or merging B-spline curves is a frequently used technique in geometric modeling, and is usually implemented in CAD-systems. These algorithms are basically numerical interpolations using the least squares method. The problem, how to replace two or more curves which are generated separately and defined as B-spline curves, has well functioning numerical solutions, therefore, relatively f...
متن کاملFairing Spatial B-spline Curves
Three-dimensional curves are playing an increasing role in ship-hull modeling and many other areas of computer-aided design (CAD). The problem of evaluating and improving the fairness of such a curve is considered and three solutions (algorithms) are proposed representing all major methodologies currently pursued by CAD researchers: local fairing by knot removal, and local/global fairing based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.2030